The Minor Crossing Number of Graphs with an Excluded Minor
نویسندگان
چکیده
منابع مشابه
The Minor Crossing Number of Graphs with an Excluded Minor
The minor crossing number of a graph G is the minimum crossing number of a graph that contains G as a minor. It is proved that for every graph H there is a constant c, such that every graph G with no H-minor has minor crossing number at most c|V (G)|.
متن کاملPlanar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that every graph that excludes a fixed graph as a minor has a planar decomposition with bounded width and a linear number of bags. The crossing number of a graph is ...
متن کاملThe Minor Crossing Number
The minor crossing number of a graph G is defined as the minimum crossing number of all graphs that contain G as a minor. Basic properties of this new invariant are presented. We study topological structure of graphs with bounded minor crossing number and obtain a new strong version of a lower bound based on the genus. We also give a generalization of an inequality of Moreno and Salazar crossin...
متن کاملAn Excluded Minor Characterization of Seymour Graphs
A graph G is said to be aSeymour graph if for any edge set F there exist |F | pairwise disjoint cuts each containing exactly one element of F , provided for every circuit C of G the necessary condition |C∩F | ≤ |C \F | is satisfied. Seymour graphs behave well with respect to some integer programs including multiflow problems, or more generally odd cut packings, and are closely related to matchi...
متن کاملMinor-monotone crossing number
The minor crossing number of a graph G, mcr(G), is defined as the minimum crossing number of all graphs that contain G as a minor. We present some basic properties of this new minor-monotone graph invariant. We give estimates on mcr for some important graph families using the topological structure of graphs satisfying mcr(G) ≤ k.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2008
ISSN: 1077-8926
DOI: 10.37236/728